منابع مشابه
Patterns in random binary search trees
Ž . ABSTRACT: In a randomly grown binary search tree BST of size n, any fixed pattern occurs with a frequency that is on average proportional to n. Deviations from the average case are highly unlikely and well quantified by a Gaussian law. Trees with forbidden patterns occur with an exponentially small probability that is characterized in terms of Bessel functions. The results obtained extend t...
متن کاملProfile and Height of Random Binary Search Trees
The purpose of this article is to survey recent results on distributional properties of random binary search trees. In particular we consider the profile and the height.
متن کاملPatterns in Random Binary Search
In a randomly grown binary search tree (BST) of size n, any xed pattern occurs with a frequency that is on average proportional to n. Deviations from the average case are highly unlikely and well quantiied by a Gaussian law. Trees with forbidden patterns occur with an exponentially small probability that is characterized in terms of Bessel functions. The results obtained extend to BSTs a type o...
متن کاملMaximal Clades in Random Binary Search Trees
We study maximal clades in random phylogenetic trees with the Yule–Harding model or, equivalently, in binary search trees. We use probabilistic methods to reprove and extend earlier results on moment asymptotics and asymptotic normality. In particular, we give an explanation of the curious phenomenon observed by Drmota, Fuchs and Lee (2014) that asymptotic normality holds, but one should normal...
متن کاملExpected Shape of Random Binary Search Trees
This entry contains proofs for the textbook results about the distributions of the height and internal path length of random binary search trees (BSTs), i. e. BSTs that are formed by taking an empty BST and inserting elements from a fixed set in random order. In particular, we prove a logarithmic upper bound on the expected height and the Θ(n log n) closed-form solution for the expected interna...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures and Algorithms
سال: 1997
ISSN: 1042-9832,1098-2418
DOI: 10.1002/(sici)1098-2418(199710)11:3<223::aid-rsa2>3.0.co;2-2